Back to Backtracking: Controlling the ATMS

نویسندگان

  • Johan de Kleer
  • Brian C. Williams
چکیده

The ATMS (A ssumption-Based Truth Maintenance Systern) provides a very general futility ior all types of default reasoning. One of the principal advantages of the ATMS is that cl11 of the possible (usually mutually inconsistent) solutions or partial solutions are directly available to the problem solver. By exploiting this capability of the ATMS, the problem solver can eficiently work on all solutions simultaneously and avoid the computational expense of backtracking. However, for some applications this ATMS capability is more of a hindrance than a help and some form of backtracking is necessary. This paper first outlines some of the reasons why backtracking is still necessary, and presents a powerful backtracking algorithm which we have implemented which backtracks more eficiently than other approaches. for problems where only one of a number of the possible solutions arc required. It achieves this efficiency by organixing the search to find a single specific solution first. By combining them we get the advantages of both.

منابع مشابه

A Correct Non-Monotonic ATMS

In this paper, we investigate technical methods to deal with exceptions, inconsistencies, and ambiguity. Existing reason maintenance systems are only suitable for some of these problems. Doyle's TMS handles exceptions properly, but gets in trouble with non-monotonic odd or even loops. On the other hand, de Kleer's ATMS produces too many contexts if there are exceptions of exceptions. Therefore,...

متن کامل

Fast hypothetical reasoning system using inference-path network

While it i s a very useful knowledge-processing framework applicable to many practical problems, the most crucial problem of logic-based hypothetical reasoning system is its slow inference speed. This paper describes a fast hypothetical reasoning system named KICKSHOTGAN, which avoids inefficient backtracking by forming a compiled inference-path network followed by the forward synthesis of nece...

متن کامل

Bilateral Teleoperation Systems Using Backtracking Search optimization Algorithm Based Iterative Learning Control

This paper deals with the application of Iterative Learning Control (ILC) to further improve the performance of teleoperation systems based on Smith predictor. The goal is to achieve robust stability and optimal transparency for these systems. The proposed control structure make the slave manipulator follow the master in spite of uncertainties in time delay in communication channel and model pa...

متن کامل

Connict-directed Backjumping Revisited

In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classi ed as look-ahead schemes and look-back schemes. Unfortunately, look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-a...

متن کامل

Conflict-Directed Backjumping Revisited

In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classiied as look-ahead schemes and look-back schemes. Unfortunately , look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1986